Discrete groups with finite decomposition complexity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Coherence of Groups and Finite Decomposition Complexity

The weak regular coherence (WRC) property of a finitely generated group Γ was introduced by G. Carlsson and this author to play the role of a weakening of Waldhausen’s regular coherence as part of computation of the integral K-theoretic assembly map. This property is a coarse invariant of the word metric. It was shown that groups with finite asymptotic dimension (FAD) have this property. A new ...

متن کامل

Weak Coherence and the K -theory of Groups with Finite Decomposition Complexity

The weak regular coherence is a coarse property of a finitely generated group Γ. It was introduced by G. Carlsson and this author to play the role of a weakening of Waldhausen’s regular coherence as part of computation of the integral K-theoretic assembly map. A new class of metric spaces (sFDC) was introduced recently by A. Dranishnikov and M. Zarichnyi. This class includes most notably the sp...

متن کامل

Some Finite and Discrete Groups

We have have encountered several finite groups in the previous chapter: the cyclic group Zn, the symmetric group Sn, and its subgroup the alternating group An. The properties of these groups will be elaborated in this chapter. We will also discuss three other groups obtained by incorporating ‘reflections’ into Zn, the dihedral group Dn, the generalized quaterion group Qn, and the dicyclic group...

متن کامل

Computational Complexity in Finite Groups

We survey recent results on the asymptotic complexity of some of the fundamental computational tasks in finite groups in a variety of computational models. A striking recent feature is that techniques motivated by the problems of the more abstract models (nondeterminism, extreme parallelization) have turned out to provide powerful tools in the design of surprisingly efficient algorithms on real...

متن کامل

Finite groups with three relative commutativity degrees

‎‎For a finite group $G$ and a subgroup $H$ of $G$‎, ‎the relative commutativity degree of $H$ in $G$‎, ‎denoted by $d(H,G)$‎, ‎is the probability that an element of $H$ commutes with an element of $G$‎. ‎Let $mathcal{D}(G)={d(H,G):Hleq G}$ be the set of all relative commutativity degrees of subgroups of $G$‎. ‎It is shown that a finite group $G$ admits three relative commutativity degrees if a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Groups, Geometry, and Dynamics

سال: 2013

ISSN: 1661-7207

DOI: 10.4171/ggd/186